Broadcasting on Incomplete Star Graph Interconnection Networks
نویسندگان
چکیده
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broadcasting m messages on the incomplete star, we also present an optimal algorithm in O ( n log n+m). Multi-message broadcasting as done first by transmitting m messages to each substar in a pipelined fashion and then by using the algorithm in [I21 to broadcast them.
منابع مشابه
Optimal broadcasting on incomplete star graph interconnection networks
Broadcasting is an important collective communication operation in many applications which use parallel computing. In this paper, we focus on designing broadcasting algorithms for general incomplete star graphs. We propose two optimal one-to-all broadcasting algorithms for incomplete star graphs with a single-port communication model. An incomplete star graph with N nodes, where (n 1)! < N < n!...
متن کاملMulti-Node Broadcasting in Hypercubes and Star Graphs
Technological advances have made building complicated large-scale multicomputer networks possible. The binary hypercube [7] is undoubtedly one of the most popular interconnection networks for parallel processing. Another candidate is the star graph [1], which has been recognized as an attractive alternative to the hypercube. A large number of researches have studied the star graph, focusing on ...
متن کاملOTIS-Star an Attractive Alternative Network
This paper proposes a new interconnection network referred to as the OTIS-Star which is constructed from multiplying a factor network star Sn by it self. In this paper we utilize the features of OTIS networks which use both of electronic and optical networks. Aِlthough the star graph has been an important research issue for long time it suffers from many problems mainly its limited efficiency in...
متن کاملOptimal Information Dissemination in Star and Pancake Networks
This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide & conquer paradigm for weak order problems on very complex architectures as the Star graph or the Pancake. As applications, we introduce asymptotically optimal algorithms for Broadcasting, Gossiping, and Semigroup operations for such interconnection ne...
متن کاملNeighbourhood Broadcasting Scheme for Star Interconnection Networks
This paper proposes a new Neighbourhood broadcasting scheme in the Star Interconnection Networks which takes at most 1.33 log2(n− 1) + O(1) time steps. The scheme is better than of [3] which takes at most 1.5 log2(n− 2) + O(1) time steps. With the same number of steps, the paper also proposes another Neighbourhood broadcasting scheme which performs better than that of [3]. The proposed scheme w...
متن کامل